num_of_prices = int(input())
lst = [int(x) for x in input().split(" ")]
second_max = lst[1]
current_max_index = 0
for i in range(1, num_of_prices):
if lst[current_max_index] < lst[i]:
second_max = lst[current_max_index]
current_max_index = i
elif lst[i] > second_max:
second_max = lst[i]
print(current_max_index+1, second_max)#include<bits/stdc++.h>
#define ll long long
typedef unsigned long long ull;
#define PI 3.141592653589793238462
#define eps 0.00001
#define ld long double
ll mod = pow(10,9)+7;
using namespace std;
///////////////////////////////////////////////////////////////////////
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
// cin>>t;
while(t--){
ll n; cin>>n;
vector<ll>v(n);
for(ll i=0; i<n; i++){
cin>>v[i];
}
auto it = max_element(v.begin(),v.end());
ll ind = it-v.begin()+1;
sort(v.begin(),v.end());
cout<<ind<<" "<<v[n-2]<<endl;
}
return 0;
}
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |